Slop based Partitioning for Vertical Fragmentation in Distributed Database System
نویسندگان
چکیده
منابع مشابه
Slop based Partitioning for Vertical Fragmentation in Distributed Database System
A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Vertical Partitioning puts frequently accessed attributes of the relation together in a fragment. Various researchers have proposed different algorithms for Vertical Partitioning. Still, there is a scope of improvement in previous algorithms for Vertical Partitioning. In this paper a new algorithm i...
متن کاملVertical Class Fragmentation in a Distributed Object Based System
Processing costs in distributed processing environments is most often dominated by the network communications required for interprocess communication. It is well-known from the distributed relational database design research that careful placement of data \near" the users or processors where it is used is mandatory or system performance will suuer greatly. Data placement in relational database ...
متن کاملAn Optimized Scheme for Vertical Partitioning of a Distributed Database
This paper proposes a scheme for vertical partitioning of a database at the design cycle. When a partition is formed, attributes are divided among various systems or even throughout different geographical locations. This may result in situations where a query may include attributes that are located at different sites. The scheme determines the hit ratio of a partition. As long as it falls below...
متن کاملVertical Fragmentation and Allocation in Distributed Deductive Database Systems
Although approaches for vertical fragmentation and data allocation have been proposed 13, 16], algorithms for vertical fragmentation and allocation of data and rules in distributed deductive database systems (DDDBSs) are lacking. In this paper, we present diierent approaches for vertical fragmentation of relations that are referenced by rules and an allocation strategy for rules and fragments i...
متن کاملNew Objective Function for Vertical Partitioning in Database System
In this paper we introduce the objective function for vertical partitioning in database systems. It has been built with the new evaluative criterion: cache hit probability. Testing the validity of the derived evaluative formula via program simulation shows its high accuracy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/17360-7870